A Recursive Algorithm for Finding the Minimum Norm Point in an Unbounded Polyhedron
نویسندگان
چکیده
We present a recursive algorithm for finding the minimum norm point in an unbounded, wnvex and pointed polyhedron defined by finite sets of points and rays. The algorithm can start at an arbitrary point of the polyhedron and does not require to solve systems of linear equations.
منابع مشابه
Iterative scheme based on boundary point method for common fixed point of strongly nonexpansive sequences
Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...
متن کاملAn Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm
The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm whose objective is to minimum a combination of the cost functions of the Least Mean Square (LMS) and Least Mean Fourth (LMF) algorithms. This algorithm has inherited many properties and advantages of the LMS and LMF algorithms and mitigated their weaknesses in some ways. The main issue of the LMMN algorithm is t...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملA Smoothing Technique for the Minimum Norm Solution of Absolute Value Equation
One of the issues that has been considered by the researchers in terms of theory and practice is the problem of finding minimum norm solution. In fact, in general, absolute value equation may have infinitely many solutions. In such cases, the best and most natural choice is the solution with the minimum norm. In this paper, the minimum norm-1 solution of absolute value equation is investigated. ...
متن کاملA Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
A path following algorithm is proposed for finding a solution to the nonlinear stationary point problem on an unbounded, convex and pointed polyhedron. The algorithm can start at an arbitrary point of the polyhedron. The path to be foliowed by the algorithm is described as the path of zeros of some piecewise continuously differentiable function defined on an appropriate subdivided manifold. Thi...
متن کامل